On Four Colored Sets with Nondecreasing Diameter and the Erdős–Ginzburg–Ziv Theorem
نویسندگان
چکیده
منابع مشابه
On four color monochromatic sets with nondecreasing diameter
Let m and r be positive integers. Define f(m, r) to be the least positive integer N such that for every coloring of the integers 1, . . . , N with r colors there exist monochromatic subsets B1 and B2 (not necessarily of the same color), each having m elements, such that (a) max(B1)−min(B1) ≤ max(B2)−min(B2), and (b) max(B1) < min(B2). We improve previous upper bounds to determine that f(m, 4) =...
متن کاملOn three sets with nondecreasing diameter
Let [a, b] denote the integers between a and b inclusive and, for a finite subset X ⊆ Z, let diam (X) = max(X) − min(X). We write X <p Y provided max(X) < min(Y ). For a positive integer m, let f(m,m,m; 2) be the least integer N such that any 2-coloring ∆ : [1, N ] → {0, 1} has three monochromatic m-sets B1, B2, B3 ⊆ [1, N ] (not necessarily of the same color) with B1 <p B2 <p B3 and diam (B1) ...
متن کاملMonochromatic and zero-sum sets of nondecreasing diameter
For positive integers m and r define f (m, r) to be the minimum integer n such that for every coloring of {1,2 . . . . . n} with r colors, there exist two monochromatic subsets B 1, B2~{1, 2 . . . . . n} (but not necessarily of the same color) which satisfy: (i)IBll=lB21=m; (ii) The largest number in B 1 is smaller than the smallest number in B2; (iii) The diameter of the convex hull spanned by...
متن کاملMonochromatic and Zero-Sum Sets of Nondecreasing Modified Diameter
Let m be a positive integer whose smallest prime divisor is denoted by p, and let Zm denote the cyclic group of residues modulo m. For a set B = {x1, x2, . . . , xm} of m integers satisfying x1 < x2 < · · · < xm, and an integer j satisfying 2 ≤ j ≤ m, define gj(B) = xj − x1. Furthermore, define fj(m, 2) (define fj(m, Zm)) to be the least integer N such that for every coloring ∆ : {1, . . . ,N} ...
متن کاملOn the harmonic index and harmonic polynomial of Caterpillars with diameter four
The harmonic index H(G) , of a graph G is defined as the sum of weights 2/(deg(u)+deg(v)) of all edges in E(G), where deg (u) denotes the degree of a vertex u in V(G). In this paper we define the harmonic polynomial of G. We present explicit formula for the values of harmonic polynomial for several families of specific graphs and we find the lower and upper bound for harmonic index in Caterpill...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2002
ISSN: 0097-3165
DOI: 10.1006/jcta.2002.3277